Interactive Curve Constrained Functional Maps
نویسندگان
چکیده
منابع مشابه
Shortcut Node Classification for Membrane Residue Curve Maps
comNode classification within Membrane Residue Curves (M-RCMs) currently hinges on Lyapunov’s Theorem and therefore the computation of mathematically complex eigenvalues. This paper presents an alternative criterion for the classification of nodes within M-RCMs based on the total membrane flux at node compositions. This paper demonstrates that for a system exhibiting simple permeation behaviour...
متن کاملLength-Constrained Bézier Curve Smoothing
We study the curve smoothing problem in the context of Bézier curves of constant length. Specifically, we present a degree-independent simulated annealing based technique to smooth a lengthconstrained Bézier curve with arbitrary, user-specified geometric constraints. Smoothing is accomplished in two stages. First, a generalized degree-independent technique is used to generate several Bézier cur...
متن کاملConstrained curve fitting on manifolds
When designing curves on surfaces the need arises to approximate a given noisy target shape by a smooth fitting shape. We discuss the problem of fitting a B-spline curve to a point cloud by squared distance minimization in the case that both, the point cloud and the fitting curve, are constrained to lie on a smooth manifold. The on-manifold constraint is included by using the first fundamental ...
متن کاملCurve approximation and constrained shortest path problems
We study the following problem k-constrained shortest path problem: given an acyclic directed graph D = (V,E) with arc weights ci,j , (i, j) ∈ E, two nodes s and t and an integer k, nd a shortest st-path containing at most k arcs. An important application of the problem in linear curve approximation is discussed. Vertices and edges of associated polytopes are determined, and integrality of thes...
متن کاملInteractive Constrained Association Rule Mining
We investigate ways to support interactive mining sessions, in the setting of association rule mining. In such sessions, users specify conditions (queries) on the associations to be generated. Our approach is a combination of the integration of querying conditions inside the mining phase, and the incremental querying of already generated associations. We present several concrete algorithms and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Graphics Forum
سال: 2018
ISSN: 0167-7055
DOI: 10.1111/cgf.13486